Improvements in Latent Semantic Analysis
نویسندگان
چکیده
منابع مشابه
Improvements in Latent Semantic Analysis
This paper proposes and examines modifications for the method of Latent Semantic Analysis (LSA). Several new local and global weight functions, along with normalization routines, are disclosed. Changes in the general structure of LSA are discussed. An application of LSA, in which the method is used to filter advertisements in e-mail, proves the worthiness of the advancements.
متن کاملQuery expansion based on relevance feedback and latent semantic analysis
Web search engines are one of the most popular tools on the Internet which are widely-used by expert and novice users. Constructing an adequate query which represents the best specification of users’ information need to the search engine is an important concern of web users. Query expansion is a way to reduce this concern and increase user satisfaction. In this paper, a new method of query expa...
متن کاملLatent Ambiguity in Latent Semantic Analysis?
Latent Semantic Analyis (LSA) consists in the use of SVD-based dimensionality-reduction to reduce the high dimensionality of vector representations of documents, where the dimensions of the vectors correspond simply to word counts in the documents. We show that that there are two contending, inequivalent, formulations of LSA. The distinction between the two is not generally noted and while some...
متن کاملProbabilistic Latent Semantic Analysis
Probabilistic Latent Semantic Analysis is a novel statistical technique for the analysis of two{mode and co-occurrence data, which has applications in information retrieval and ltering, natural language processing, machine learning from text, and in related areas. Compared to standard Latent Semantic Analysis which stems from linear algebra and performs a Singular Value Decomposition of co-occu...
متن کاملLatent Semantic Analysis (Tutorial)
We will see that the number of eigenvalues is n for an n× n matrix. Regarding eigenvectors, if x is an eigenvector then so is ax for any scalar a. However, if we consider only one eigenvector for each ax family, then there is a 1-1 correspondence of such eigenvectors to eigenvalues. Typically, we consider eigenvectors of unit length. Diagonal matrices are simple, the eigenvalues are the entries...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: American Journal of Undergraduate Research
سال: 2004
ISSN: 1536-4585,2375-8732
DOI: 10.33697/ajur.2004.018